Generating Small Combinatorial Test Suite via LP
نویسندگان
چکیده
Generating a set of combinatorial test cases for web application and development is very important. Linear programming (LP) is one of approaches to generating small combinatorial test suite. But, for software under test (SUT), the number of combinatorial test cases is often extremely large. If using LP to optimize test suite, the optimizing efficiency is low for the enormous size of LP variables and constraints (we call macro-LP). In view of the issue, we propose a new approach to optimization of test suite by using LP. The main ideas is to divide macro-LP into microLP which has relatively small sizes of LP variables and constraints. Experimental results show that the approach can improve the efficiency of solving test suite via LP greatly.
منابع مشابه
catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming
We develop an approach to test suite generation for Constrained Combinatorial Testing (CCT), one of the most widely studied combinatorial testing techniques, based on Answer Set Programming (ASP). The resulting catnap system accepts a CCT instance in fact format and combines it with a first-order encoding for generating test suites, which can subsequently be solved by any off-the-shelf ASP syst...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملGenerating Combinatorial Test Suite with Solution Space Tree for Configurations Testing of Sensors Networks
There are many results about generating pair-wise covering arrays with strength τ=2 have been reported, but fewer results are published for high-strength covering arrays with a higher-strength τ>2. In configuration testing of sensor networks, high-strength covering array is required to construct combinatorial test cases. To generate combinatorial test suite with higher-strength, a backtracking ...
متن کاملGenerating an Automated Test Suite by Variable Strength Combinatorial Testing for Web Services
Testing Web Services has become the spotlight of software engineering as an important means to assure the quality of Web application. Due to lacking of graphic interface and source code, Web services need an automated testing method, which is an important part in efficiently designing and generating test suite. However, the existing testing methods may lead to the redundancy of test suite and t...
متن کاملA deterministic density algorithm for pairwise interaction coverage
Pairwise coverage of factors affecting software has been proposed to screen for potential errors. Techniques to generate test suites for pairwise coverage are evaluated according to many criteria. A small number of tests is a main criterion, as this dictates the time for test execution. Randomness has been exploited to search for small test suites, but variation occurs in the test suite produce...
متن کامل